Application Of Signed Graph In Decision Making
نویسندگان
چکیده
A signed graph may be defined as an ordered pair (G, σ) where G= (V, E) is the graph and σ is a function called signature or sign mapping from E to the sign group {+, -}. People or friends are considered as the vertices and the relationships between these friends are considered as the edges. '+' sign is assigned to the edge for good relationship and '-' sign for bad relationship between the friends. Two terms “friendship matrix” or “judgement matrix” and “character point C.P” are introduced in this paper. Using the concept of friendship matrix and C.P in various fields the characteristics or performances could be evaluated. In this paper different problems have been considered and analysed with the help of signed graph. Indexing terms/
منابع مشابه
CERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS
In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...
متن کاملA NEW MULTIPLE CRITERIA DECISION-MAKING METHOD BASED ON BIPOLAR FUZZY SOFT GRAPHS
In this research study, we present a novel frame work for handling bipolar fuzzy soft information by combining bipolar fuzzy soft sets with graphs. We introduce several basic notions concerning bipolar fuzzy soft graphs and investigate some related properties. We also consider the application of the bipolar fuzzy soft graphs. In particular, three efficient algorithms are developed to solve mult...
متن کاملOn net-Laplacian Energy of Signed Graphs
A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...
متن کاملSIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL
Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.
متن کاملMore Equienergetic Signed Graphs
The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy. In the literature the construction of equienergetic signed graphs are reported. In this paper we obtain the characteristic polynomial and energy of the join of two signed graphs and thereby we give another construction ...
متن کامل